polynomial time造句
例句與造句
- A polynomial time algorithm in positive define geometric programming with constraints
約束正定式幾何規(guī)劃的一種多項式時間算法 - Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于該問題不能在多項式時間內求得最優(yōu)解，因而被公認為一個np完全問題。 - The complexity of kf - diff is o ( nlogn ) , while n is the number of the nodes in the tree , vs . polynomial time for previous algorithms
在算法復雜度上從先前的多項式時間提高到o ( nlogn ) ，其中n為文檔結點數。 - Radio communications systems , department of signals , sensors and systems , royal institute of technology , 10044 stockholm , sweden , october 2002 . 10 hajck b , wieselthier j . link scheduling in polynomial time
絕大部分方法在網絡中有20 30個結點， 100 200條鏈路時就需要花幾天甚至更多的時間來尋找最優(yōu)調度。 - It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method , thus these four types of problems can be solved in polynomial time
用數學規(guī)劃的方法證明了四類多準則下的單機排序問題可以轉化為指派問題，從而這四類問題都多項式時間可解。 - It's difficult to find polynomial time in a sentence. 用polynomial time造句挺難的
- A set of algorithms are designed to address the two challenges and then a service pool can be automatically constructed and managed for given reliability and performance requirements in polynomial time
為此，我們設計了一組算法，在給定的可靠性和性能范圍內，通過算法的調度，可以在多項式時間內對服務池自動地進行構造和管理。 - We prove that the worst - case ratio of algorithm d is 15 / 13 , which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity
我們證明了對三臺機情形，算法d的最壞情況界為15 13 ，該算法的最壞情況界和時間復雜性優(yōu)于除近似方案以外的已有近似算法。 - The experiments show that the performance of our method is similar to the ye - 0 . 699 algorithm , which is the best approximate algorithm in polynomial time . but our method can effectively solve the max - bisection problem with a large scale . 2
數值實驗表明,該方法與ye - 0 . 699近似算法（現有的求解圖的最大二等分問題的最好的多項式時間近似算法）得到的解的性能幾乎沒有差異 - As the determination of such optimal multicast routes was computationally intractable in polynomial time , a multicast routing algorithm based on genetic algorithm was proposed to simultaneously optimize different parameter , in which multiple multicast tree route solutions were generated
由于多播路由的最優(yōu)選擇問題在多項式時間內難以求解，提出一種使用遺傳算法的路由算法來同時優(yōu)化不同的服務質量指標，計算產生出幾種路由樹。 - In this thesis , firstly , the existing heuristic algorithms for steiner tree problem are summarized ; secondly , a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented . through simulation , we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time . at last , the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented
本論文首先綜述了多播路由問題的理論基礎，接著對滿足qos約束的多播路由問題進行了研究，提出了一種快速的時延受限最小代價多播路由算法，該算法簡單、快捷，能在多項式時間內找到滿足時延約束的代價較小的多播樹，具有良好的性能；最后，研究了wdm光傳送網中的多播路由和波長分配問題，并提出了wdm全光網絡中的多播路由與波長分配算法，該算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類算法的較高復雜性。 - In this paper , first , i present a new model of vrp and a heuristic algorithm of it . then , i have proofed that on the distance constrained vrp , any polynomial time heuristic h for mv , we have kh / kv > 2 ; and i give a dynamic programming recursion heuristic of md . furthermore , i study some stochastic vehicle routing problem also
并證明了在距離約束的vrp情形下對于目標函數mv (車輛數最小) ，其任一有多項式時間的啟發(fā)式算法h得到的車輛數目k ~ h和最優(yōu)車輛數目k ~ v滿足關系k ~ h k ~ v 2 ，我們還給出了md (總距離最小)的一個動態(tài)規(guī)劃算法。 - In solving npc problems , the development of complete polynomial time approximation scheme for 0 - 1 knapsack problem is the most successful example , the thesis analyzes the common points between the scheme and algorithm1 ( being in practice ) , 2 , then describes the key factors influencing the performances of the algorithm 1 , 2 , which provide a good approach to instruct the improvement and application of ec optimization . due to the complex mutual - influences between pc and ec , the global optimal tsc is even much more difficult
文中闡述了算法1 、 2 (現有實用的緊急控制尋優(yōu)算法和本文構造的算法)與之的相通之處，指出尋優(yōu)初始基值策略是影響算法1 、 2性能的關鍵因素，而算法1則是算法2在基值選擇策略上的一種細化，為指導緊急控制優(yōu)化算法進一步改善和應用提供了很好的思路。 - The distributed system recently got much attentions as one of the hot topics in the research of computer science . the task scheduling algorithm plays a very important role in enhancing this system ' s parallel performance and maintaining it ' s load equation . the scheduling problem has turned out to be a npc problem and optimal solutions can not be found in polynomial time . so , many people make great efforts on finding a better algorithm which can produce a better solution within limited cost . some algorithms which have been thought out can find satisfactory solutions . but incur high time complexity . which tend to exacerbate in more complex environments
其中的任務調度問題，對發(fā)揮系統的并行性能和保持負載平衡具有非常重要的意義。該問題已被證明是一個npc問題，無法在多項式時間內找到最優(yōu)解，所以促使人們不懈地研究如何設計調度算法，用有限的代價獲得更好的解?，F有的啟發(fā)式算法雖然能夠得到滿意解，但是計算的時間復雜度較高，當問題規(guī)模很大時，求解效率不高。 - The ctm is suitable for the case that all e - type influentially uncontrollable subnets are state graphs , and the outstanding virtue is that the designed controller is explicit . the emm is suitable for the case that all f - type influentially uncontrollable subnets are normalized cascade petri nets , and the advantage is that control patterns can be on - line computed within polynomial times
約束變換法適用于所有e -型影響不可控子網為狀態(tài)圖這種特殊的場合，用該方法所綜合的控制器最大的優(yōu)點在于所董利達:浙江大學博士論文獲得的控制器是顯式的;特征標識法適用于所有凡型影響不可控子網為規(guī)范化序狀petri網這種場合，用該方法設計的控制器在線運算工作量是多項式可解的。
更多例句： 下一頁